Tableaux for Verification of Data-Centric Processes
Identifieur interne : 001474 ( Main/Exploration ); précédent : 001473; suivant : 001475Tableaux for Verification of Data-Centric Processes
Auteurs : Andreas Bauer [Australie] ; Peter Baumgartner [Australie] ; Martin Diller [Australie] ; Michael Norrish [Australie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Current approaches to analyzing dynamic systems are mostly grounded in propositional (temporal) logics. As a consequence, they often lack expressivity for modelling rich data structures and reasoning about them in the course of a computation. To address this problem, we propose a rich modelling framework based on first-order logic over background theories (arithmetics, lists, records, etc) and state transition systems over corresponding interpretations. On the reasoning side, we introduce a tableau calculus for bounded model checking of properties expressed in a certain fragment of CTL* over that first-order logic. We also describe a k-induction scheme on top of that calculus for proving safety properties, and we report on first experiments with a prototypical implementation.
Url:
DOI: 10.1007/978-3-642-40537-2_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000304
- to stream Istex, to step Curation: 000303
- to stream Istex, to step Checkpoint: 000100
- to stream Main, to step Merge: 001486
- to stream Main, to step Curation: 001474
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Tableaux for Verification of Data-Centric Processes</title><author><name sortKey="Bauer, Andreas" sort="Bauer, Andreas" uniqKey="Bauer A" first="Andreas" last="Bauer">Andreas Bauer</name></author><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name></author><author><name sortKey="Diller, Martin" sort="Diller, Martin" uniqKey="Diller M" first="Martin" last="Diller">Martin Diller</name></author><author><name sortKey="Norrish, Michael" sort="Norrish, Michael" uniqKey="Norrish M" first="Michael" last="Norrish">Michael Norrish</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0DDE8BF64D20FE8B445B8783447D7ECB6B022DF1</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_5</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-T9F05L40-S/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000304</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000304</idno><idno type="wicri:Area/Istex/Curation">000303</idno><idno type="wicri:Area/Istex/Checkpoint">000100</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000100</idno><idno type="wicri:doubleKey">0302-9743:2013:Bauer A:tableaux:for:verification</idno><idno type="wicri:Area/Main/Merge">001486</idno><idno type="wicri:Area/Main/Curation">001474</idno><idno type="wicri:Area/Main/Exploration">001474</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Tableaux for Verification of Data-Centric Processes</title><author><name sortKey="Bauer, Andreas" sort="Bauer, Andreas" uniqKey="Bauer A" first="Andreas" last="Bauer">Andreas Bauer</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>NICTA and Australian National University, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>NICTA and Australian National University, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author><author><name sortKey="Diller, Martin" sort="Diller, Martin" uniqKey="Diller M" first="Martin" last="Diller">Martin Diller</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>NICTA and Australian National University, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author><author><name sortKey="Norrish, Michael" sort="Norrish, Michael" uniqKey="Norrish M" first="Michael" last="Norrish">Michael Norrish</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>NICTA and Australian National University, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Current approaches to analyzing dynamic systems are mostly grounded in propositional (temporal) logics. As a consequence, they often lack expressivity for modelling rich data structures and reasoning about them in the course of a computation. To address this problem, we propose a rich modelling framework based on first-order logic over background theories (arithmetics, lists, records, etc) and state transition systems over corresponding interpretations. On the reasoning side, we introduce a tableau calculus for bounded model checking of properties expressed in a certain fragment of CTL* over that first-order logic. We also describe a k-induction scheme on top of that calculus for proving safety properties, and we report on first experiments with a prototypical implementation.</div></front></TEI><affiliations><list><country><li>Australie</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Bauer, Andreas" sort="Bauer, Andreas" uniqKey="Bauer A" first="Andreas" last="Bauer">Andreas Bauer</name></noRegion><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><name sortKey="Diller, Martin" sort="Diller, Martin" uniqKey="Diller M" first="Martin" last="Diller">Martin Diller</name><name sortKey="Norrish, Michael" sort="Norrish, Michael" uniqKey="Norrish M" first="Michael" last="Norrish">Michael Norrish</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001474 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001474 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:0DDE8BF64D20FE8B445B8783447D7ECB6B022DF1
|texte= Tableaux for Verification of Data-Centric Processes
}}
| This area was generated with Dilib version V0.6.33. |  |